Chung-Feller Property of Schröder Objects
نویسندگان
چکیده
Large Schröder paths, sparse noncrossing partitions, partial horizontal strips, and 132-avoiding alternating sign matrices are objects enumerated by Schröder numbers. In this paper we give formula for the number of Schröder objects with given type and number of connected components. The proofs are bijective using ChungFeller style. A bijective proof for the number of Schröder objects with given type is provided. We also give a combinatorial interpretation for the number of small Schröder paths.
منابع مشابه
Chung-Feller Property in View of Generating Functions
The classical Chung-Feller Theorem offers an elegant perspective for enumerating the Catalan number cn = 1 n+1 ( 2n n ) . One of the various proofs is by the uniformpartition method. The method shows that the set of the free Dyck n-paths, which have ( 2n n ) in total, is uniformly partitioned into n + 1 blocks, and the ordinary Dyck n-paths form one of these blocks; therefore the cardinality of...
متن کاملRefined Chung-Feller theorems for lattice paths
In this paper we prove a strengthening of the classical Chung-Feller theorem and a weighted version for Schröder paths. Both results are proved by refined bijections which are developed from the study of Taylor expansions of generating functions. By the same technique, we establish variants of the bijections for Catalan paths of order d and certain families of Motzkin paths. Moreover, we obtain...
متن کاملEnumeration of Fuss-Schröder paths
In this paper we enumerate the number of (k, r)-Fuss-Schröder paths of type λ. Y. Park and S. Kim studied small Schröder paths with type λ. Generalizing the results to small (k, r)-Fuss-Schröder paths with type λ, we give a combinatorial interpretation for the number of small (k, r)-Fuss-Schröder paths of type λ by using Chung-Feller style. We also give two sets of sparse noncrossing partitions...
متن کاملStrings of Length 3 in Grand-Dyck Paths and the Chung-Feller Property
This paper deals with the enumeration of Grand-Dyck paths according to the statistic “number of occurrences of τ” for every string τ of length 3, taking into account the number of flaws of the path. Consequently, some new refinements of the Chung-Feller theorem are obtained.
متن کاملGeneralizations of Chung-feller Theorems
In this paper, we develop a method to find Chung-Feller extensions for three kinds of different rooted lattice paths and prove Chung-Feller theorems for such lattice paths. In particular, we compute a generating function S(z) of a sequence formed by rooted lattice paths. We give combinatorial interpretations to the function of Chung-Feller type S(z)−yS(yz) 1−y for the generating function S(z). ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 23 شماره
صفحات -
تاریخ انتشار 2016